greedy number theory *1300

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1e6+5;
int n,a[maxn],anss,sum=0;
int ans=0x3f3f3f3f;
signed main(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i],sum+=a[i];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        if(i==1){
            for(int j=1;j<=a[i];j++){
                if(a[i]%j==0){
                    ans=min(ans,sum-a[i]-a[2]+a[i]/j+a[2]*j);
                }
            }
        }
        else {
            for(int j=1;j<=a[i];j++){
                if(a[i]%j==0){
                    ans=min(ans,sum-a[1]-a[i]+a[i]/j+a[1]*j);
                }
            }
        }
    }
    cout<<ans;
}


Comments

Submit
0 Comments
More Questions

1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game